Drug-Target Interaction Prediction via Dual Laplacian Graph Regularized Matrix Completion
نویسندگان
چکیده
منابع مشابه
Neighborhood Regularized Logistic Matrix Factorization for Drug-Target Interaction Prediction
In pharmaceutical sciences, a crucial step of the drug discovery process is the identification of drug-target interactions. However, only a small portion of the drug-target interactions have been experimentally validated, as the experimental validation is laborious and costly. To improve the drug discovery efficiency, there is a great need for the development of accurate computational approache...
متن کاملClimate Prediction via Matrix Completion
Recently, machine learning has been applied to the problem of predicting future climates, informed by the multi-model ensemble of physics-based climate models that inform the Intergovernmental Panel on Climate Change (IPCC). Past work (Monteleoni et al., 2011, McQuade and Monteleoni, 2012) demonstrated the promise of online learning algorithms applied to this problem. Here we propose a novel ap...
متن کاملProtein-Protein Interaction Prediction via Structured Matrix Completion
This paper considers how to computationally predict unknown protein-protein interactions (PPIs) given the experimentally verified PPIs. Matrix completion, a very popular machine learning technique that can be used to to infer the missing part of a matrix, has been introduced to recover the missing interactions of an incomplete PPI network. The benefit of Matrix completion is that it does not re...
متن کاملLink Prediction via Matrix Completion
Ratha Pech, Hao Dong1,2,∗, Liming Pan, Hong Cheng, Zhou Tao1,2,∗ 1 CompleX Lab, University of Electronic Science and Technology of China, Chengdu 611731, People’s Republic of China 2 Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 611731, People’s Republic of China and 3 Center for Robotics, University of Electronic Science and Technology of China, Ch...
متن کاملGraph Matrix Completion in Presence of Outliers
Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BioMed Research International
سال: 2018
ISSN: 2314-6133,2314-6141
DOI: 10.1155/2018/1425608